A New Zero-finder for Tikhonov Regularization
نویسندگان
چکیده
Tikhonov regularization with the regularization parameter determined by the discrepancy principle requires the computation of a zero of a rational function. We describe a cubically convergent zero-finder for this purpose. AMS subject classification: 65F22, 65H05, 65R32.
منابع مشابه
A numerical approach for solving a nonlinear inverse diusion problem by Tikhonov regularization
In this paper, we propose an algorithm for numerical solving an inverse non-linear diusion problem. In additional, the least-squares method is adopted tond the solution. To regularize the resultant ill-conditioned linear system ofequations, we apply the Tikhonov regularization method to obtain the stablenumerical approximation to the solution. Some numerical experiments con-rm the utility of th...
متن کاملThe prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces
It is known, by Rockafellar (SIAM J Control Optim 14:877–898, 1976), that the proximal point algorithm (PPA) converges weakly to a zero of a maximal monotone operator in a Hilbert space, but it fails to converge strongly. Lehdili and Moudafi (Optimization 37:239–252, 1996) introduced the new prox-Tikhonov regularization method for PPA to generate a strongly convergent sequence and established a...
متن کاملOn the Local Regularization of Inverse Problems of Volterra Type
We consider a local regularization method for the solution of first-kind Volterra integral equations with convolution kernel. The local regularization is based on a splitting of the original Volterra operator into “local” and “global” parts, and a use of Tikhonov regularization to stabilize the inversion of the local operator only. The regularization parameters for the local procedure include t...
متن کاملNear-Optimal Parameters for Tikhonov and Other Regularization Methods
Choosing the regularization parameter for an ill-posed problem is an art based on good heuristics and prior knowledge of the noise in the observations. In this work, we propose choosing the parameter, without a priori information, by approximately minimizing the distance between the true solution to the discrete problem and the family of regularized solutions. We demonstrate the usefulness of t...
متن کاملSelecting the Corner in the -Curve Approach to Tikhonov Regularization
The performance of two methods for selecting the corner in the -curve approach to Tikhonov regularization is evaluated via computer simulation. These methods are selecting the corner as the point of maximum curvature in the -curve, and selecting it as the point where the product of abcissa and ordinate is a minimum. It is shown that both these methods resulted in significantly better regulariza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008